Adaptive proportionality - Opportunistic Scheduling for High Speed Packet Access MIMO Systems

In MIMO system, it is known that Multi-user diversity can be used to increase the sum system throughput. The maximization of the throughput under quality of service (QoS) constraints is a still open field for research. In this paper, a scheduling algorithm that uses fairness among users as a QoS constraint is considered. This algorithm, called Adaptive Proportionality Opportunistic Scheduling (APOS), can meet a trade-off between throughput and fairness. To achieve this goal the APOS scheme allocates each spatial channel by sorting users in a descending order of their channel signal to interference plus noise ratios (SINR), and selects the user owning the worst case performance among the L users owning the first sorted SINRs. Accordingly, each space channel is allocated to the user owning the L best SINRs and a min of average rate to proportionality coefficient rate r_k(t)/ k α . To show the performance of the proposed scheme a selection of simulation results is used. These results show that APOS outperforms some well-known scheduling algorithms.